Managing Best Eeort Traac: Red
نویسنده
چکیده
Best eeort traac in the Internet is managed by end to end congestion control mechanisms whose limitations are known. The continuous Internet growth leads to more and more applications that don't \play the rules" of the end-to-end congestion control scheme. Simple mechanisms inside the routers, refered as random early detection (RED), provide a more eecient congestion control. It can also be used to protect fair applications from unfair ones. RED can be deployed progressively as it does not require any modiication of the applications using the classical Internet congestion control scheme. The Internet has been primarily designed and will probably be used in the forthcoming years to carry best eeort traac. To allow eecient managing of best eeort traac, congestion control mechanisms have been deened. These mechanisms apply on a end-to-end basis, and are implemented in the transport protocol, TCP. Among them is the well-known additive increase, multiplicative decrease 5]. First, we describe two aspects of problems that exist with the TCP congestion control scheme (its imperfection and the impact of possibly non compliant sources) and present the approaches that are proposed to solve them. We then show how the RED mechanisms can achieve a much more eecient congestion control. We discuss the way to used them (in association with simple scheduling techniques) to prevent non compliant sources to deprive compliant ones. Finally, we discuss the advantages and drawbacks of using explicit congestion notiication instead of packet drops.
منابع مشابه
Eruf: Early Regulation of Unresponsive Best-eeort Traac
In this paper, we propose router mechanisms to regulate unresponsive best-eeort traac. By unresponsive traac, we mean ows that do not reduce their sending rate in response to congestion. The goal of the proposed mechanisms is to drop undeliverable packets as close to the periphery of the network as possible. The key ideas of our approach are: (1) edge routers keep track of incoming ows and thei...
متن کاملSupport for Multiple Classes of Traffic in Multicomputer Routers
Emerging parallel real-time and multimedia applications broaden the range of performance requirements imposed on the inter-connection network. This communication typically consists of a mixture of diierent traac classes, where guaranteed packets require bounds on latency or throughput while good average performance suuces for the best-eeort traac. This paper investigates how multicomputer route...
متن کاملHardware Support for Controlled Interaction of Guaranteed and Best-eeort Communication
Real-time communication typically consists of guaranteed packets that must satisfy their delivery deadlines and best-eeort packets that can tolerate occasional deadline misses for improved average latency. This paper presents hardware techniques for supporting the coexistence of these two traac classes in real-time point-to-point networks. A careful selection of routing and switching techniques...
متن کاملPrioritized Multiprocessor Networks: Design and Performance
This paper proposes and evaluates prioritized direct shared-memory multiprocessor networks. We use three components to implement prioritized networks, namely, priority-based link arbitration, priority inheritance , and dynamic virtual channels. The two major results from our study are: (i) adding priorities to direct shared-memory multiprocessor networks can lead to reduced average transaction ...
متن کاملOn the Integration of Best-Effort and Guaranteed Performance Services
One of the main challenges of emerging high speed telecommunication networks is the integration of services. Both ATM as well as the INTERNET have been evolving so as to accomodate both best-eeort type traac (such as le transfer) as well as real time traac requiring guaranteed performance. The coexistence of these two service types on the same network carries important beneets such as resource ...
متن کامل